package QuickSort;

import java.sql.Array;
import java.util.Arrays;

import static QuickSort.QuickSort.quick;

public class Test {
    public static void main(String[] args) {
        int[] array = new int[20];

        for (int j = 1; j <= 20; j++) {
            //array[j-1] = j;
            //逆序
            array[20 - j] = j;
        }
        System.out.println("排序前：" + Arrays.toString(array));
        quick(array, 0, 19);
        System.out.println("排序后：" + Arrays.toString(array));

    }
}
